Verification of real-time systems through lazy approximations
نویسنده
چکیده
ing timed systems
منابع مشابه
Safety Verification of Real Time Systems Serving Periodic Devices
In real-time systems response to a request from a controlled object must be correct and timely. Any late response to a request from such a device might lead to a catastrophy. The possibility of a task overrun, i.e., missing the deadline for completing a requested task, must be checked and removed during the design of such systems. Safe design of real-time systems running periodic tasks under th...
متن کاملAn Optimistic Concurrency Control Protocol for Real-Time Database Systems
Transactions in real-time database systems are associated with certain timing constraints derived either from temporal consistency requirements of data or from requirements imposed on system reaction time. Fundamental requirements of real-time database systems are timeliness, i.e., the ability to produce expected transaction results early or at the right time, and predictability, i.e., the abil...
متن کاملLazy Reachability Analysis in Distributed Systems
We address the problem of reachability in distributed systems, modelled as networks of finite automata and propose and prove a new algorithm to solve it efficiently in many cases. This algorithm allows to decompose the reachability objective among the components, and proceeds by constructing partial products by lazily adding new components when required. It thus constructs more and more precise...
متن کاملA Lazy SMT-Solver for a Non-Linear Subset of Real Algebra
There are several methods for the synthesis and analysis of hybrid systems that require efficient algorithms and tool for satisfiability checking. In this paper we give examples of such synthesis and analysis methods, and discuss decision procedures that can be used for this purpose.
متن کاملLazy Approximation for Dense Real-Time Systems
ing TCTL Formulas Abstraction predicates are extracted from the timed-bounded modalities of the TCTL formula A new clock variable zi is introduced for every time-bounded operator Example: φ = EG<2 p ∧ A[qU≤4 r] Set of predicates: Ψφ = {z1 < 2 } {{ } ψ1 , z2 ≤ 4 } {{ } ψ2 } Abstract CTL formula: φ̂ = EG(p∧ψ1) ∧ A[qU (r∧ψ2)] Lazy Approximation – p.6 Soundness and Completeness Basis predicates: Set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004